Influences of Limiting Magnitude upon Meteor Frequency
نویسندگان
چکیده
منابع مشابه
Rank distributions: Frequency vs. magnitude
We examine the relationship between two different types of ranked data, frequencies and magnitudes. We consider data that can be sorted out either way, through numbers of occurrences or size of the measures, as it is the case, say, of moon craters, earthquakes, billionaires, etc. We indicate that these two types of distributions are functional inverses of each other, and specify this link, firs...
متن کاملLimiting performance of frequency-hop random access
The multiple-access capability of asynchronous frequencyhop packet radio networks is analyzed. The only interference considered is multiple-access interference, and perfect side information is assumed. Bounds are developed on the probability of error for unslotted systems based on the distributions of the maximum and minimum interference levels over the duration of a given packet, and these are...
متن کاملGlobal frequency of magnitude 9 earthquakes
For decades seismologists have sought causal relationships between maximum earthquake sizes and other properties of subduction zones, with the underlying notion that some subduction zones may never produce a magnitude ~9 or larger event. The 2004 Andaman Mw 9.2 earthquake called into question such ideas. Given multicentury return times of the greatest earthquakes, ignorance of those return time...
متن کاملFractal dimension and earthquake frequency-magnitude distribution in the North of Central-East Iran Blocks (NCEIB)
The Gutenberg–Richter parameters (a and b), fractal dimension (DC), and relationships between these parameters are calculated for different regions of the North of Central-East Iran Blocks (NCEIB). The whole examined area (between 34°-36° N and 55°-61° E) is divided into 55 equal square grids. Both the a and b values for the frequency-magnitude distribution (FMD) and the fractal dimension (DC) ...
متن کاملImproving upon Maximum Independent Set by five orders of magnitude
Several algorithms are presented. The standard algorithm generates all N anticliques of a graph with v vertices in time O(Nv). It can be adapted to e.g. generate all maximum cardinality anticliques, or just one maximum anticlique. The latter is our main achievement and was programmed using the Mathematica 6.0 code. For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1939
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.25.5.243